Decomposable Log-linear Models Decomposable Log-linear Models

نویسنده

  • P. Svante Eriksen
چکیده

The present paper considers discrete probability models with exact computational properties. In relation to contingency tables this means closed form expressions of the maksimum likelihood estimate and its distribution. The model class includes what is known as decomposable graphical models, which can be characterized by a structured set of conditional independencies between some variables given some other variables. We term the new model class decomposable log-linear models, which is illustrated to be a much richer class than decomposable graphical models. It covers a wide range of non-hierarchical models, models with structural zeroes, models described by quasi independence and models for level merging. Also, they have a very natural interpretation as they may be formulated by a structured set of conditional independencies between two events given some other event. In relation to contingency tables we term such independencies as context specific independencies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Combining Decomposable Graphical Models

We propose an algorithm for combining decomposable graphical models and apply it for building decomposable graphical log-linear models which involve a large number of variables. A main idea in this algorithm is that we group the random variables that are involved in the data into several subsets of variables, build graphical log-linear models for the marginal data, and then combine the marginal...

متن کامل

Graphical Log-Linear Models: Fundamental Concepts and Applications

We present a comprehensive study of graphical log-linear models for contingency tables. High dimensional contingency tables arise in many areas such as computational biology, collection of survey and census data and others. Analysis of contingency tables involving several factors or categorical variables is very hard. To determine interactions among various factors, graphical and decomposable l...

متن کامل

On the Toric Algebra of Graphical Models By

We formulate necessary and sufficient conditions for an arbitrary discrete probability distribution to factor according to an undirected graphical model, or a log-linear model, or other more general exponential models. For decomposable graphical models these conditions are equivalent to a set of conditional independence statements similar to the Hammersley–Clifford theorem; however, we show tha...

متن کامل

Context Speciic Interaction Models

Interaction models for categorical data play a central role in applied statistics. In particular, decomposable models have obtained a dominant position as the basis for structural learning and the development of eecient computational algorithms in connection with Bayesian networks for decision support. The present paper generalizes decompos-able models to cover log linear models, where interact...

متن کامل

The mode oriented stochastic search (MOSS) algorithm for log-linear models with conjugate priors

We describe a novel stochastic search algorithm for rapidly identifying regions of high posterior probability in the space of decomposable, graphical and hierarchical log-linear models. Our approach is based on the Diaconis-Ylvisaker conjugate prior for log-linear parameters. We discuss the computation of Bayes factors through Laplace approximations and the Bayesian iterative proportional fitti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005